Mixed-quantum-state detection with inconclusive results
نویسندگان
چکیده
منابع مشابه
Mixed-quantum-state detection with inconclusive results
We consider the problem of designing an optimal quantum detector with a fixed rate of inconclusive results that maximizes the probability of correct detection, when distinguishing between a collection of mixed quantum states. We show that the design of the optimal detector can be formulated as a semidefinite programming problem, and derive a set of necessary and sufficient conditions for an opt...
متن کاملInconclusive Quantum Measurements and Decisions under Uncertainty
We give a mathematical definition for the notion of inconclusive quantum measurements. In physics, such measurements occur at intermediate stages of a complex measurement procedure, with the final measurement result being operationally testable. Since the mathematical structure of Quantum Decision Theory (QDT) has been developed in analogy with the theory of quantum measurements, the inconclusi...
متن کاملMixed-state entanglement and quantum error correction.
Entanglement purification protocols (EPP) and quantum errorcorrecting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a bipartite mixed state M ; with a QECC, an arbitrary quantum state |ξ〉 can be transmitted at some rate Q through a noisy channel χ without degrada...
متن کاملImproved constructions of mixed state quantum automata
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A. Ambainis and R. Freivalds that quantum finite automata with pure states can have an exponentially smaller number of states than deterministic finite automata recognizing the same language. There was an unpublished ‘‘folk th...
متن کاملQuantum State Detection via Elimination
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant fraction of the candidate secret states with high probability. Finally, we show that elimination observables do not always exist by considering the geometry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2003
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.67.042309